Algorithm for optimal coloring of square (0,1)-matrices
نویسندگان
چکیده
The paper proposes an algorithm for solving the configuration-optimization coloring problem square (0,1)-matrices, which is based on method of selection their structural features. belongs to method's backtracking, however, construction optimal solution carried out among options that provide a certain configuration, due size search tree significantly reduced. A detailed scheme its operation given, and effectiveness demonstrated by example calculating chromatic number specific (0,1)-matrix.
منابع مشابه
A practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملAn Optimal Algorithm for Online Square Detection
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that the m-th prefix of S contains a square. The online square detection problem is to determine m as soon as the m-th character of S is read. The best previously known algorithm of the online square detection problem, du...
متن کاملOn the square root of quadratic matrices
Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.
متن کاملA fast symmetric SVD algorithm for square Hankel matrices
This paper presents an O(n2 log n) algorithm for computing the symmetric singular value decomposition of square Hankel matrices of order n, in contrast with existing O(n3) SVD algorithms. The algorithm consists of two stages: first, a complex square Hankel matrix is reduced to a complex symmetric tridiagonal matrix using the block Lanczos method in O(n2 log n) flops; second, the singular values...
متن کاملAn Optimal Distributed $(\Delta+1)$-Coloring Algorithm?
Vertex coloring is one of the classic symmetry breaking problems studied in distributed com-puting. In this paper we present a new algorithm for (∆ + 1)-list coloring in the randomizedLOCAL model running in O(log n + Detd(poly logn)) time, where Detd(n ′) is the determinis-tic complexity of (deg+1)-list coloring (v’s palette has size deg(v) + 1) onn′-vertex graphs.This impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ??????? ?????-?????????????? ????????????
سال: 2023
ISSN: ['1811-9905', '2542-2251']
DOI: https://doi.org/10.21638/11701/spbu10.2023.108